منابع مشابه
On Poset Sandwich Problems
A graph Gs = (V,Es) is a sandwich for a pair of graph Gt = (V,Et) and G = (V,E) if Et ⊆ Es ⊆ E. Any poset, or partially ordered set, admits a unique graph representation which is directed and transitive. In this paper we introduce the notion of sandwich poset problems inspired by former sandwich problems on comparability graphs. In particular, we are interested in seriesparallel and interval po...
متن کاملGraph sandwich problems
A sandwich problem for a graph with respect to a graph property Π is a partially specified graph, i.e., only some of the edges and non-edges are given, and the question to be answered is, can this graph be completed to a graph which has the property Π? The graph sandwich problem was investigated for a large number of families of graphs in a 1995 paper by Golumbic, Kaplan and Shamir, and much su...
متن کاملOn the Complexity of (k, l)-Graph Sandwich Problems
In 1995 Golumbic, Kaplan and Shamir defined graph sandwich problems as follows: graph sandwich problem for property Π (Π-sp) Input: Two graphs G = (V,E) and G = (V,E) such that E ⊆ E. Question: Is there a graph G = (V,E) satisfying the property Π such that E ⊆ E ⊆ E? The graphG is called sandwich graph for the pair (G, G). Note that making E = E = E we have the recognition problem for the prope...
متن کاملCan transitive orientation make sandwich problems easier?
A graph G s = (V , E s) is a sandwich for a pair of graphs G t = (V , E t) and G = (V , E) if E t ⊆ E s ⊆ E. A sandwich problem asks for the existence of a sandwich graph having an expected property. In a seminal paper, Golumbic et al. [Graph sandwich problems, J. Algorithms 19 (1995) 449–473] present many results on sub-families of perfect graphs. We are especially interested in comparability ...
متن کاملEquivalences on Acyclic Orientations
The cyclic and dihedral groups can be made to act on the set Acyc(Y ) of acyclic orientations of an undirected graph Y , and this gives rise to the equivalence relations ∼κ and ∼δ, respectively. These two actions and their corresponding equivalence classes are closely related to combinatorial problems arising in the context of Coxeter groups, sequential dynamical systems, the chip-firing game, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Brazilian Computer Society
سال: 2012
ISSN: 0104-6500,1678-4804
DOI: 10.1007/s13173-012-0065-7